A Highly Random Number Ver
نویسندگان
چکیده
In his celebrated 1936 paper Turing de ned a machine to be circular i it performs an in nite computation outputting only nitely many symbols. We de ne as the probability that an arbitrary machine be circular and we prove that is a random number that goes beyond , the probability that a universal self delimiting machine halts. The algorithmic complexity of is strictly greater than that of , but similar to the algorithmic complexity of , the halting probability of an oracle machine. What makes interesting is that it is an example of a highly random number de nable without considering oracles.
منابع مشابه
On the distribution of the number of isolated vertices in random undirected graphs
A classical topic in the theory of random graphs is the number of isolated ver-tices in a given random graph. In particular, it is a typical example of threshold behaviour. In this paper we give exact closed forms for the distribution and the moments of the numbers of isolated vertices. Furthermore, we present a surprisingly simple approximation of the probability that there exist isolated vert...
متن کاملA Critical Point for Random Graphs with a Given Degree Sequence
Given a sequence of non-negative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n ver-tices of degree i. Essentially, we show that if P i(i?2) i > 0 then such graphs almost surely have a giant component, while if P i(i?2) i < 0 then almost surely all components in such graphs are small. We can apply these results to G n;p ; G n;M , and other well-kno...
متن کاملLinear Arboricity of Random Regular Graphs
An easy count ing argument shows here that la(G)>f . f f t " d i f f icu l ty is in establishing the upper bound. This problem has received much attention; see Alon [1]. We show here how Alon's beautiful treatment for graphs with large girth allows us easily to handle random regular graphs. By the random regular graph G,,, (where rn is even) we mean a graph picked uniformly at random from the s...
متن کاملConstructing a Maximal Independent Set in Parallel
f a The problem of constructing in parallel a maximal independent set o given graph is considered. A new deterministic NC -algorithm implet mented in the EREW PRAM model is presented. On graphs with n ver ices and m edges, it uses O ((n +m )/logn ) processors and runs in O (log n ) 3 c time. This reduces by a factor of logn both the running time and the pro essor count of the previously fastest...
متن کاملVERMICULITE WITH Ag AND Cu USED AS AN ANTIBACTERIAL NANOFILLER IN POLYETHYLENE VERMIKULIT S Ag A Cu POUŽITÝ JAKO ANTIBAKTERIÁLNÍ NANOPLNIVO V POLYETHYLENU
Vermiculite (Ver) enriched with silver and copper was used as nanofiller to the polyethylene (PE) matrix. Specifically, the low density polyethylene (LDPE) was chosen as a matrix. The samples Ver-Ag,Cu were prepared by shaking of Ver with the aqueous solutions of silver and copper nitrate. The mixtures of the Ver nanofillers and PE were homogenized by melt compounding technique and further thin...
متن کامل